Maximum number of fixed points in AND-OR-NOT networks
نویسندگان
چکیده
We are interested in the number of fixed points in AND-OR-NOT networks, i.e. Boolean networks in which the update function of each component is either a conjunction or a disjunction of positive or negative literals. As main result, we prove that the maximum number of fixed points in a loop-less connected AND-OR-NOT network with n components is at most the maximum number of maximal independent sets in a loop-less connected graph with n vertices, a quantity already known.
منابع مشابه
Toughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملطبقهبندی آریتمیهای قلبی مبتنی بر ترکیب نتایج شبکههای عصبی با نظریه شواهد دمپستر- شفر
Cardiac arrhythmias are one of the most common heart diseases that may cause the death of the patient. Therefore, it is extremely important to detect cardiac arrhythmias. 3 categories of arrhythmia, namely, PAC, PVC, and normal are considered in this paper based on classifier fusion using evidence theory. In this study, at first a sample is carrying out the ECG signal with 250 point. Moreove...
متن کاملDynamic Frailty and Change Point Models for Recurrent Events Data
Abstract. We present a Bayesian analysis for recurrent events data using a nonhomogeneous mixed Poisson point process with a dynamic subject-specific frailty function and a dynamic baseline intensity func- tion. The dynamic subject-specific frailty employs a dynamic piecewise constant function with a known pre-specified grid and the baseline in- tensity uses an unknown grid for the piecewise ...
متن کاملFixed points and maximal independent sets in AND-OR networks
We study the maximum number of 2xed points of boolean networks with local update function AND–OR. We prove that this number for networks with connected digraph is 2(n−1)=2 for n odd and 2(n−2)=2 + 1 for n even if the digraph has not loops; and 2n−1 + 1 otherwise, where n is the number of nodes of the digraph. We also exhibit some networks reaching these bounds. To obtain these results we constr...
متن کاملIdentification and risk assessment in the process of blood donation in a fixed blood collection center of Saqez city by Failure Mode and Effects Analysis
Abstract Background and Objectives Risk is a combination of the likelihood of an incident occurring and the severity of the consequences if that incident were to occur. The aim of this research is to identify and evaluate the risk factors in the blood donation process in a fixed blood collection center of Saqez city by failure mode and effects analysis (FMEA). Materials and Methods It is a des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 80 شماره
صفحات -
تاریخ انتشار 2014